The Turán Number Of The Fano Plane
نویسندگان
چکیده
Moreover, the only extremal configuration can be obtained by partitioning an n-element set into two almost equal parts, and taking all the triples that intersect both of them. This extends an earlier result of de Caen and Füredi, and proves an old conjecture of V. Sós. In addition, we also prove a stability result for the Fano plane, which says that a 3-uniform hypergraph with density close to 3/4 and no Fano plane is approximately 2-colorable.
منابع مشابه
The Turán problem for projective geometries
We consider the following Turán problem. How many edges can there be in a (q + 1)-uniform hypergraph on n vertices that does not contain a copy of the projective geometry PGm(q)? The case q = m = 2 (the Fano plane) was recently solved independently and simultaneously by Keevash and Sudakov (The Turán number of the Fano plane, Combinatorica, to appear) and Füredi and Simonovits (Triple systems n...
متن کاملSink Location Service Based on Fano Plane in Wireless Sensor Networks
Sink location is considered as a basic service in geographic routing in wireless sensor networks. Obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. In this paper, a sink location algorithm based on Fano plane is proposed. The research challenge is how to ensure the intersection of two SLQ (Location Q...
متن کاملThe co-degree density of the Fano plane
It is shown that every n vertex triple system with every pair of vertices lying in at least (1/2 + o(1))n triples contains a copy of the Fano plane. The constant 1/2 is sharp. This is the first triple system for which such a (nonzero) constant is determined. Let X be a finite set. An r-graph F with vertex set X is a family of r-element subsets of X. These subsets are called edges, and X is writ...
متن کاملA hypergraph regularity method for generalized Turán problems
Wedescribe amethod that we believemay be foundational for a comprehensive theory of generalized Turán problems. The cornerstone of our approach is a quasirandom counting lemma for quasirandom hypergraphs, which extends the standard counting lemma by not only counting copies of a particular configuration but also showing that these copies are evenly distributed.We demonstrate the power of the me...
متن کاملCounting substructures II: triple systems
For various triple systems F , we give tight lower bounds on the number of copies of F in a triple system with a prescribed number of vertices and edges. These are the first such results for hypergraphs, and extend earlier theorems of various authors who proved that there is one copy of F . A sample result is the following: Füredi-Simonovits [10] and independently KeevashSudakov [15] settled an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorica
دوره 25 شماره
صفحات -
تاریخ انتشار 2005